Applying Variable Minimal Unsatisfiability in Model Checking
نویسندگان
چکیده
منابع مشابه
Variable Minimal Unsatisfiability
In this paper, we present variable minimal unsatisfiability (VMU), which is a generalization of minimal unsatisfiability (MU). A characterization of a VMU formula F is that every variable of F is used in every resolution refutation of F . We show that the class of VMU formulas is D -complete. For fixed deficiency (the difference of the number of clauses and the number of variables), the VMU for...
متن کاملMinimal Unsatisfiability and Autarkies
The topic of this chapter is the study of certain forms of “redundancies” in propositional conjunctive normal forms and generalisations. In Sections 11.1 11.7 we study “minimally unsatisfiable conjunctive normal forms” (and generalisations), unsatisfiable formulas which are irredundant in a strong sense, and in Sections 11.8 11.13 we study “autarkies”, which represent a general framework for co...
متن کاملChecking Unsatisfiability for OCL Constraints
In this paper we propose a mapping from a subset of OCL into firstorder logic (FOL) and use this mapping for checking the unsatisfiability of sets of OCL constraints. Although still preliminary work, we argue in this paper that our mapping is both simple, since the resulting FOL sentences closely mirror the original OCL constraints, and practical, since we can use automated reasoning tools, suc...
متن کاملAcyclic Formulas and Minimal Unsatisfiability⋆
We call a boolean formula (in CNF) stable acyclic if the associated digraph is free of a certain type of cycles. We show that satisfiability and recognition are polynomial–time solvable problems for stable acyclic formulas. Further, we show that a minimal unsatisfiable formula is stable acyclic if and only if the number of clauses exceeds the number of variables exactly by one (this subclass of...
متن کاملApplying Model Checking in Java Verification
This paper presents our experiences in applying the Java PathFinder (Jpf), a recently developed Java to Promela translator, in the search for synchronization bugs in a Chinese Chess game server application written in Java. We give an overview of Jpf and the subset of Java that it supports and describe an initial effort to abstract and analyze the game server. Finally, we evaluate the results of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software
سال: 2008
ISSN: 1000-9825
DOI: 10.3724/sp.j.1001.2008.00039